The Diagonal Method and Hypercomputation

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Block Diagonal Preconditioners for the Schur Complement Method Block Diagonal Preconditioners for the Schur Complement Method

We present numerical methods for solving systems of linear equations originated from the discretisation of two-dimensional elliptic partial diierential equations. We are interested in diierential equations that describe heterogeneous and anisotropic phenomena. We use a nonoverlapping domain decomposition method for solving the linear systems. We describe new local preconditioners for the interf...

متن کامل

The case for hypercomputation

The weight of evidence supporting the case for hypercomputation is compelling. We examine some 20 physical and mathematical models of computation that are either known or suspected to have super-Turing or hypercomputational capabilities, and argue that there is nothing in principle to prevent the physical implementation of hypercomputational systems. Hypercomputation may indeed be intrinsic to ...

متن کامل

New Physics and Hypercomputation

Does new physics give us a chance for designing computers, at least in principle, which could compute beyond the Turing barrier? By the latter we mean computers which could compute some functions which are not Turing computable. Part of what we call “new physics” is the surge of results in black hole physics in the last 15 years, which certainly changed our perspective on certain things. The tw...

متن کامل

Zeno machines and hypercomputation

This paper reviews the Church-Turing Thesis (or rather, theses) with reference to their origin and application and considers some models of “hypercomputation”, concentrating on perhaps the most straight-forward option: Zeno machines (Turing machines with accelerating clock). The halting problem is briefly discussed in a general context and the suggestion that it is an inevitable companion of an...

متن کامل

Non-Classical Hypercomputation

Hypercomputation that seeks to solve the Halting Problem, or to compute Turing-uncomputable numbers, might be called “classical” hypercomputation, as it moves beyond the classical Turing computational paradigm. There are further computational paradigms that we might seek to move beyond, forming the basis for a wider “non-classical” hypercomputation. This paper surveys those paradigms, and poses...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The British Journal for the Philosophy of Science

سال: 2005

ISSN: 0007-0882,1464-3537

DOI: 10.1093/phisci/axi108